Hilbert Function and Complexity Lower Bounds for Symmetric Boolean Functions
نویسندگان
چکیده
منابع مشابه
Upper and lower bounds of symmetric division deg index
Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...
متن کاملLower Bounds for Threshold and Symmetric Functions in Parallel Computation
We consider the family of decision problems of the threshold languages L g. A threshold language L g is the set of n bit vectors having at least g(n) \1"s. Using a new technique for controlling the size and structure of a hypergraph by a potential function, we prove lower bounds for these decision problems on a PRIORITY PRAM with m shared memory cells and any polynomial number of processors. Th...
متن کاملBounded Arithmetic and Lower Bounds in Boolean Complexity
We study the question of provability of lower bounds on the com plexity of explicitly given Boolean functions in weak fragments of Peano Arithmetic To that end we analyze what is the right frag ment capturing the kind of techniques existing in Boolean complexity at present We give both formal and informal arguments support ing the claim that a conceivable answer is V which in view of RSUV isomo...
متن کاملDistribution-Free Testing Lower Bounds for Basic Boolean Functions
In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input domain. We consider distribution-free testing of several basic Boolean function classes over {0, 1}, namely monotone conjunctions, general conjunctions, decision lists, and linear threshold functions. We prove that for eac...
متن کاملCohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity
This paper is motivated by questions such as P vs. NP and other questions in Boolean complexity theory. We describe an approach to attacking such questions with cohomology, and we show that using Grothendieck topologies and other ideas from the Grothendieck school gives new hope for such an attack. We focus on circuit depth complexity, and consider only finite topological spaces or Grothendieck...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1999
ISSN: 0890-5401
DOI: 10.1006/inco.1999.2798